Convergent upper bounds in global minimization with nonlinear equality constraints
نویسندگان
چکیده
منابع مشابه
Nonlinear Robust Optimization with Uncertain Equality Constraints
The problem of nonlinear optimization for process design under uncertainty is addressed in this paper. A novel robust optimization framework is proposed to address general nonlinear problems under uncertainty. To address the limitation of single point linearization with respect to uncertain parameters for a large uncertainty region, an iterative algorithm is developed. The new method applies lo...
متن کاملConvergent Bounds for Stochastic Programs with Expected Value Constraints
This article elaborates a bounding approximation scheme for convex multistage stochastic programs (MSP) that constrain the conditional expectation of some decision-dependent random variables. Expected value constraints of this type are useful for modelling a decision maker’s risk preferences, but they may also arise as artefacts of stage-aggregation. It is shown that the gap between certain upp...
متن کاملControl Problems with Equality Constraints
not available at time of publication. Dimitris Bertsimas Massachusetts Insitute of Technology [email protected] MS8 Less is More: Robustness and Sparsity in Multivariate Statistics We describe applications of robust optimization in the context of machine learning, with a focus on classification and regression, principal component analysis and fitting of graphical models. In these tasks, sparsity...
متن کاملEntailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally...
متن کاملNegative Set Constraints with Equality
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. So far two proofs of decidability of mixed set constraints have been given: However, both these proofs are long, involved and do not seem to extend to more general set constraints. Our approach is based on a reduction of set constraints to the mona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01493-2